Multivariate Quadratic Quasigroup Polynomial based Cryptosystem in Vanet

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Weil Sum Evaluation of Central Polynomial in Multivariate Quadratic Cryptosystem

Abstract. A parity checking-styled Weil sum algorithm is presented for a general class of the univariate polynomials which fully characterize a system of n polynomials in n variables over F2. The previously known proof methods of explicit Weil sum evaluation of Dembowski-Ostrom polynomials are extended to general case. The algorithm computes the absolute values of the Weil sums of the generic c...

متن کامل

Multivariate Quadratic Trapdoor Functions Based on Multivariate Quadratic Quasigroups

We have designed a new class of multivariate quadratic trapdoor functions. The trapdoor functions are generated by quasigroup string transformations based on a class of quasigroups called multivariate quadratic quasigroups (MQQ). The public key schemes using these trapdoor functions are bijective mappings, they do not perform message expansions and can be used both for encryption and signatures...

متن کامل

Quasigroup based crypto-algorithms

Modifications of Markovski quasigroup based crypto-algorithm have been proposed. Some of these modifications are based on the systems of orthogonal n-ary groupoids. T -quasigroups based stream ciphers have been constructed. 2000 Mathematics Subject Classification: 94A60, 20N05, 20N15

متن کامل

A new cryptosystem based on elliptic curves and polynomial matrices*

The system we propose is a mathematical problem with the necessary properties to define public key cryptosystems. It is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) and polynomial matrices. In this way, we achieve to increase the possible number of keys and, therefore, we augment the resolution complexity of the system. Also, we make a cryptanalisys of the system detecting its...

متن کامل

A Lattice Based Public Key Cryptosystem Using Polynomial Representations

In Crypto 97, a public key cryptosystem based on the closest vector problem was suggested by Goldreich, Goldwasser and Halevi [4]. In this paper, we propose a public key cryptosystem applying representations of polynomials to the GGH encryption scheme. Its key size is much smaller than the GGH system so that it is a quite practical and efficient lattice based cryptosystem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering & Technology

سال: 2018

ISSN: 2227-524X

DOI: 10.14419/ijet.v7i4.10.26767